Detecting the Sawtooth pattern of router buffer occupancy due to congestion control in TCP flows
نویسنده
چکیده
product, xC RTT , where RTT is the average round trip time, and C the link capacity. Subsequent work has shown that these buffer sizes are over-provisioned. Current implementations of operating systems set a maximum congestion window size of between 10 (in Windows XP) to 40 (in Linux 2.4 and 2.6). In addition, many Internet flows today are short-lived, and end with the packets still buffered in routers along the way for retransmission. This project aims to systematically study the buffer occupancy along routers to determine if the sawtooth pattern of the contention window size is ever seen, and re-assess optimal buffer sizes in the light of the findings.
منابع مشابه
A Load-Adaptive ACK Pacer for TCP Traffic Control
Introduction Delivering reliable per-flow Quality of Service in a broadband access network entails a comprehensive congestion control solution at the edge router. The edge router has no direct control over the downstream traffic sources and its egress channel (access link) usually has a smaller bandwidth than its ingress channel. Therefore, to minimize QoS-damaging congestions while maximizing ...
متن کاملA study of fairness among heterogeneous TCP variants over 10 Gbps high-speed optical networks
Several high-speed TCP variants are adopted by end users and therefore, heterogeneous congestion control has become the characteristic of newly emerging high-speed optical networks. In contrast to homogeneous TCP flows, fairness among heterogeneous TCP flows now depends on router parameters such as queue management scheme and buffer size. To the best of our knowledge, this is the first study of...
متن کاملTcp Congestion Avoidance Using Explicit Buffer Notification
This paper proposes to modify the TCP congestion control mechanism by allowing network routers to supply Explicit Buffer Notification (EBN) to the TCP data sender. The TCP sender runs an algorithm that uses the EBN feedback to compute the control window. The EBN plays the role of a generalized Advertised Window so that the EBN TCP results to be a natural extension of the current TCP flow contro...
متن کاملThe Choke Router Algorithm Provides an Approximately Fair Bandwidth Allocation at a Low Implementation Cost. the Authors Consider Performance and Implementation Issues Associated with Choke, with Particular Emphasis on Variable-length Packets
To provide high-quality service under heavy user loads, the Internet depends on congestion avoidance mechanisms implemented in the transport-layer such as the transmission-control protocol (TCP). However, many TCP implementations don’t include—either deliberately or by accident— a congestion avoidance mechanism. Moreover, a growing number of user datagram protocol (UDP)-based applications runni...
متن کاملPredicting bottleneck bandwidth sharing by generalized TCP flows
The paper presents a technique for computing the individual throughputs and the average queue occupancy when multiple TCP connections share a single bottleneck buffer. The bottleneck buffer is assumed to perform congestion feedback via randomized packet marking or drops. We first present a fixed point-based analytical technique to compute the mean congestion window sizes, the mean queue occupan...
متن کامل